60 search results - page 3 / 12 » Incremental Parser Generation for Tree Adjoining Grammars |
COGSCI
2004
14 years 11 months ago
2004
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
COLING
2010
14 years 6 months ago
2010
We present GENSEM, a tool for generating input semantic representations for two sentence generators based on the same reversible Tree Adjoining Grammar. We then show how GENSEM ca...
COLING
1996
15 years 28 days ago
1996
In this paper we show that an account for coordination can be constructed usingthederivationstructures inalexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivat...
100
Voted
ACL
2012
13 years 2 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
ACL
2000
15 years 29 days ago
2000
As an application of NLP to computer-assisted language learning(CALL) , we propose a diagnostic processing of Japanese being able to detect errors and inappropriateness of sentenc...