773 search results - page 47 / 155 » Suffix Trees on Words |
185
click to vote
ACTA
2000
15 years 6 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
165
click to vote
IPL
2002
15 years 5 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
171
click to vote
EMNLP
2011
14 years 6 months ago
2011
Machine-produced text often lacks grammaticality and fluency. This paper studies grammaticality improvement using a syntax-based algorithm based on CCG. The goal of the search pr...
161
click to vote
CAV
2004
Springer
15 years 11 months ago
2004
Springer
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
176
click to vote
KI
2004
Springer
15 years 11 months ago
2004
Springer
This paper proposes a new corpus-based approach for deriving syntactic structures and generating parse trees of natural language sentences. The parts of speech (word categories) of...