493 search results - page 31 / 99 » Generating Ambiguity in the Laboratory |
ACL
1990
13 years 10 months ago
1990
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
ACL
2009
13 years 7 months ago
2009
A central problem in grounded language acquisition is learning the correspondences between a rich world state and a stream of text which references that world state. To deal with ...
ACL
2012
11 years 11 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...
CN
1999
13 years 8 months ago
1999
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...