@inproceedings{jones-havrilla-1998-twisted,
    title = "Twisted pair grammar: support for rapid development of machine translation for low density languages",
    author = "Jones, Douglas  and
      Havrilla, Rick",
    editor = "Farwell, David  and
      Gerber, Laurie  and
      Hovy, Eduard",
    booktitle = "Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers",
    month = oct # " 28-31",
    year = "1998",
    address = "Langhorne, PA, USA",
    publisher = "Springer",
    url = "https://preview.aclanthology.org/fix-sig-urls/1998.amta-papers.28/",
    pages = "318--332",
    abstract = "We describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface."
}