DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4
Hits 61 – 74 of 74

61
On the semantics of unification grammars
In: Grammars. - Dordrecht [u.a.] : Springer Science + Business Media B.V 6 (2003) 2, 145-153
BLLDB
Show details
62
A Note on Typing Feature Structures
In: Computational linguistics. - Cambridge, Mass. : MIT Press 28 (2002) 3, 389
OLC Linguistik
Show details
63
A note on typing feature structures
In: Computational linguistics. - Cambridge, Mass. : MIT Press 28 (2002) 3, 389-397
BLLDB
Show details
64
Modular context-free grammars
In: Grammars. - Dordrecht [u.a.] : Springer Science + Business Media B.V 5 (2002) 1, 41-63
BLLDB
Show details
65
Selected papers from RANLP '97. - Recent advances in natural language processing ; 2 : Selected papers from RANLP '97. -
Grishman, Ralph (Mitarb.); Vogel, Carl (Mitarb.); Turcato, Davide (Mitarb.). - Amsterdam [u.a.] : Benjamins, 2000
BLLDB
UB Frankfurt Linguistik
Show details
66
Compostional Semantics for Unification-based Linguistics Formalisms
In: IRCS Technical Reports Series (1999)
BASE
Show details
67
Book Reviews - Parsing Schemata
In: Machine translation. - Dordrecht [u.a.] : Springer Science + Business Media 13 (1998) 2-3, 233
OLC Linguistik
Show details
68
Off-line Parsability and the Well-foundedness of Subsumption ...
Wintner, Shuly; Francez, Nissim. - : arXiv, 1997
Abstract: Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded, whereas in the presence of cycles general TFS subsumption is not well-founded. We show an application of this result for parsing, where the well-foundedness of subsumption is used to guarantee termination for grammars that are off-line parsable. We define a new version of off-line parsability that is less strict than the existing one; thus termination is guaranteed for parsing with a larger set of grammars. ... : 19 pages, 1 postscript figure, uses fullname.sty ...
Keyword: Computation and Language cs.CL; FOS Computer and information sciences
URL: https://dx.doi.org/10.48550/arxiv.cmp-lg/9709011
https://arxiv.org/abs/cmp-lg/9709011
BASE
Hide details
69
An Abstract Machine for Unification Grammars ...
Wintner, Shuly. - : arXiv, 1997
BASE
Show details
70
Amalia -- A Unified Platform for Parsing and Generation ...
BASE
Show details
71
Parsing with Typed Feature Structures ...
Wintner, Shuly; Francez, Nissim. - : arXiv, 1996
BASE
Show details
72
Parsing with Typed Feature Structures ...
Wintner, Shuly; Francez, Nissim. - : arXiv, 1996
BASE
Show details
73
Abstract Machine for Typed Feature Structures ...
Wintner, Shuly; Francez, Nissim. - : arXiv, 1995
BASE
Show details
74
Abstract Machine for Typed Feature Structures ...
Wintner, Shuly; Francez, Nissim. - : arXiv, 1994
BASE
Show details

Page: 1 2 3 4

Catalogues
2
0
19
0
4
0
1
Bibliographies
20
0
0
0
0
0
2
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
38
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern