39 search results - page 5 / 8 » Two Equivalent Regularizations for Tree Adjoining Grammars |
TAGT
1994
Springer
13 years 11 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
JOLLI
2010
13 years 5 months ago
2010
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
MFCS
2004
Springer
14 years 21 days ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
NAACL
2010
13 years 5 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
ACL
2007
13 years 8 months ago
2007
Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system performance to deteriorate. In this work we show that i...