@inproceedings{wintner-francez-1995-parsing,
    title = "Parsing with Typed Feature Structures",
    author = "Wintner, Shuly  and
      Francez, Nissim",
    editor = "Hajicova, Eva  and
      Lang, Bernard  and
      Berwick, Robert  and
      Bunt, Harry  and
      Carpenter, Bob  and
      Church, Ken  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Nagao, Makoto  and
      Nijholt, Anton  and
      Steedman, Mark  and
      Thompson, Henry  and
      Tomita, Masaru  and
      Vijay-Shanker, K.  and
      Wilks, Yorick  and
      Wittenburg, Kent",
    booktitle = "Proceedings of the Fourth International Workshop on Parsing Technologies",
    month = sep # " 20-24",
    year = "1995",
    address = "Prague and Karlovy Vary, Czech Republic",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest-emnlp/1995.iwpt-1.33/",
    pages = "273--287",
    abstract = "In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE ([2]). Our motivation being the design of an abstract (WAM-like) machine for the formalism ([14]), 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 \textit{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 \textit{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."
}