522 search results - page 5 / 105 » Automating grammar comparison |
IWPT
2001
14 years 11 months ago
2001
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
LACL
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
125
click to vote
CL
2000
Springer
14 years 10 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
EMNLP
2010
14 years 8 months ago
2010
Unknown words are a hindrance to the performance of hand-crafted computational grammars of natural language. However, words with incomplete and incorrect lexical entries pose an e...
CSL
2006
Springer
14 years 10 months ago
2006
Springer
Grammar induction, also known as grammar inference, is one of the most important research areas in the domain of natural language processing. Availability of large corpora has enc...