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
BASE
Show 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
Abstract: In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a computational process and use it as an operational semantics to guide the design of the control structures for the abstract machine. We emphasize the notion of abstract typed feature structures (AFSs) that encode the essential information of TFSs and define unification over AFSs rather than over TFSs. We then introduce an explicit construct of multi-rooted feature structures (MRSs) that naturally extend TFSs and use them to represent phrasal signs as well as grammar rules. We also employ abstractions of MRSs and give the mathematical foundations needed for manipulating them. We then present a simple bottom-up chart parser as a model for computation: grammars written in the TFS-based formalism are executed by the parser. Finally, we show that the parser is correct. ... : PostScript, 15 pages; Proc. 4th Intl. Workshop on Parsing Technologies, Prague, September 1995 ...
Keyword: Computation and Language cs.CL; FOS Computer and information sciences
URL: https://arxiv.org/abs/cmp-lg/9601010
https://dx.doi.org/10.48550/arxiv.cmp-lg/9601010
BASE
Hide 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