J. Howard Johnson

Home * People * J. Howard Johnson

J. Howard Johnson,

a Canadian computer scientist and research officer at the Institute for Information Technology, the National Research Council of Canada, in Ottawa since 1992. Before, he was professor at the University of Waterloo, where he became interested in studying algorithms for text processing and lexical analysis, such as weighted finite state transducer in natural language processing, string matching and duplicate code. As Ph.D. student at University of Waterloo in 1981, along with Jonathan Schaeffer, he co-authored the chess program Prodigy written in C [1]. Johnson wrote the control part of the program, Schaeffer put in the chess knowledge [2].

1980 …#

• J. Howard Johnson (1983). Formal Models for String Similarity. Ph.D. thesis, University of Waterloo, advisor Frank Tompa [4]
• J. Howard Johnson (1985). Do Rational Equivalence Relations have Regular Cross-Sections? ICALP 1985 [5]
• J. Howard Johnson (1986). Rational Equivalence Relations. Research Report, University of Waterloo, pdf
• J. Howard Johnson (1987). Single-Valued Finite Transduction. ICALP 1987
• J. Howard Johnson (1988). INR: A Program for Computing Finite Automata. Technical Report, University of Waterloo, pdf
• J. Howard Johnson (1989). A Unified Framework for Disambiguating Finite Transductions. Theoretical Computer Science, Vol. 63, No. 1, pdf

1990 …#

• J. Howard Johnson (1993). Identifying Redundancy in Source Code using Fingerprints. CASCON 1993
• J. Howard Johnson (1994). Substring Matching for Clone Detection and Change Tracking. ICSM 1994, pdf
• J. Howard Johnson (1994). Visualizing textual redundancy in legacy source. CASCON 1994, pdf [6]
• J. Howard Johnson (1995). Using textual redundancy to understand change. CASCON 1995
• J. Howard Johnson (1996). Navigating the textual redundancy web in legacy source. CASCON 1996

2000 …#

• J. Howard Johnson (2000). Lessons from INR in the Specification of Transductions. CIAA 2000
• J. Howard Johnson (2002). Using Textual Redundancy to Study the Maintainability of Source Code. in Hakan Erdogmus, Oryal Tanir (eds.) (2002). Advances in Software Engineering. Springer
• J. Howard Johnson (2005). Collapsing ε-Loops in Weighted Finite-State Machines. FSMNLP 2005

2010#

• J. Howard Johnson (2010). Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization. CIAA 2010

References#

1. ↑ The Twelfth ACM’s North American Computer Chess Championship, pdf from The Computer History Museum
2. ↑ Jonathan Schaeffer (1997, 2009). One Jump Ahead. 1. This Was Going to Be Easy, pp. 8
3. ↑ dblp: J. Howard Johnson
4. ↑ Students Supervised, University of Waterloo
5. ↑ Equivalence relation from Wikipedia
6. ↑ Hasse diagram from Wikipedia

Up one level