Template Matching

  • Alan Bundy
  • Lincoln Wallen
Part of the Symbolic Computation book series (SYMBOLIC)


A simple technique that is sometimes used in language understanding. A language unit (sentence or phrase) is compared with a set of predefined ‘templates’. Some positions in the template consist of variables that match any input. If a template matches the input, the variables take the value of the corresponding elements in the input. Eg. the template “Var1 hits Var2” matches the input “Mary hits John with her hand” and Var1 takes the value “Mary” and Var2 “John with her hand”. Template matching is only useful if there is a small number of templates, otherwise the matching process is too expensive.


Template Match Computational Linguistics Goal Structure Language Understanding Language Unit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Barr and Feigenbaum 81]
    Barr, A. and Feigenbaum, E.A. (editors). The Handbook of Artificial intelligence Vol. 1. Kaufmann, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Alan Bundy
    • 1
  • Lincoln Wallen
  1. 1.Department of Artificial IntelligenceEdinburgh UniversityEdinburghScotland

Personalised recommendations