25,161
edits
Changes
Created page with "'''Home * People * J. Howard Johnson''' '''J. Howard Johnson''',<br/> a Canadian computer scientist and research officer at the ''Institute for Information..."
'''[[Main Page|Home]] * [[People]] * J. Howard Johnson'''
'''J. Howard Johnson''',<br/>
a Canadian computer scientist and research officer at the ''Institute for Information Technology'',
the [https://en.wikipedia.org/wiki/National_Research_Council_%28Canada%29 National Research Council of Canada],
in [https://en.wikipedia.org/wiki/Ottawa Ottawa] since 1992. Before, he was professor at the [[University of Waterloo]],
where he became interested in studying algorithms for [https://en.wikipedia.org/wiki/Text_processing text processing] and [https://en.wikipedia.org/wiki/Lexical_analysis lexical analysis],
such as [https://en.wikipedia.org/wiki/Finite-state_transducer#Weighted_automata weighted finite state transducer] in [https://en.wikipedia.org/wiki/Natural_language_processing natural language processing], [https://en.wikipedia.org/wiki/String-searching_algorithm string matching] and [https://en.wikipedia.org/wiki/Duplicate_code 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]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6ce737 The Twelfth ACM's North American Computer Chess Championship], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1981_ACM_NACCC/1981_ACM_NACCC.sm.062303017.pdf pdf] from [[The Computer History Museum]]</ref>.
Johnson wrote the control part of the program, Schaeffer put in the [[Knowledge|chess knowledge]] <ref>[[Jonathan Schaeffer]] ('''1997, 2009'''). ''[https://www.springer.com/gp/book/9780387765754 One Jump Ahead]''. 1. This Was Going to Be Easy, pp. 8</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/j/Johnson:J=_Howard.html dblp: J. Howard Johnson]</ref>
==1980 ...==
* [[J. Howard Johnson]] ('''1983'''). ''[https://www.semanticscholar.org/paper/Formal-models-for-string-similarity-Johnson/83b8f7815a55223b6e89dd7c55be3aec3f4fdabd Formal Models for String Similarity]''. Ph.D. thesis, [[University of Waterloo]], advisor [[Mathematician#FTompa|Frank Tompa]] <ref>[https://cs.uwaterloo.ca/~fwtompa/students.html Students Supervised], [[University of Waterloo]]</ref>
* [[J. Howard Johnson]] ('''1985'''). ''[https://link.springer.com/chapter/10.1007/BFb0015755 Do Rational Equivalence Relations have Regular Cross-Sections?]'' [https://dblp.uni-trier.de/db/conf/icalp/icalp85.html ICALP 1985] <ref>[https://en.wikipedia.org/wiki/Equivalence_relation Equivalence relation from Wikipedia]</ref>
* [[J. Howard Johnson]] ('''1986'''). ''Rational Equivalence Relations''. Research Report, [[University of Waterloo]], [https://cs.uwaterloo.ca/research/tr/1986/CS-86-16.pdf pdf]
* [[J. Howard Johnson]] ('''1987'''). ''[https://link.springer.com/chapter/10.1007/3-540-18088-5_16 Single-Valued Finite Transduction]''. [https://dblp.uni-trier.de/db/conf/icalp/icalp87.html ICALP 1987]
* [[J. Howard Johnson]] ('''1988'''). ''INR: A Program for Computing Finite Automata''. Technical Report, [[University of Waterloo]], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.456.2799&rep=rep1&type=pdf pdf]
* [[J. Howard Johnson]] ('''1989'''). ''A Unified Framework for Disambiguating Finite Transductions''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 63, No. 1, [https://core.ac.uk/download/pdf/82759963.pdf pdf]
==1990 ...==
* [[J. Howard Johnson]] ('''1993'''). ''[https://dl.acm.org/doi/10.5555/962289.962305 Identifying Redundancy in Source Code using Fingerprints]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1993.html CASCON 1993]
* [[J. Howard Johnson]] ('''1994'''). ''[https://www.computer.org/csdl/proceedings-article/icsm/1994/00336783/12OmNzlD9n2 Substring Matching for Clone Detection and Change Tracking]''. [https://dblp.uni-trier.de/db/conf/icsm/icsm1994.html ICSM 1994], [https://www.cs.drexel.edu/~spiros/teaching/CS675/papers/clone-johnson.pdf pdf]
* [[J. Howard Johnson]] ('''1994'''). ''[https://dl.acm.org/doi/10.5555/782185.782217 Visualizing textual redundancy in legacy source]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1994.html CASCON 1994], [https://dl.acm.org/doi/pdf/10.5555/782185.782217 pdf] <ref>[https://en.wikipedia.org/wiki/Hasse_diagram Hasse diagram from Wikipedia]</ref>
* [[J. Howard Johnson]] ('''1995'''). ''[https://dl.acm.org/doi/10.5555/781915.781949 Using textual redundancy to understand change]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1995.html CASCON 1995]
* [[J. Howard Johnson]] ('''1996'''). ''[https://dl.acm.org/doi/10.5555/782052.782068 Navigating the textual redundancy web in legacy source]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1996.html CASCON 1996]
==2000 ...==
* [[J. Howard Johnson]] ('''2000'''). ''[https://link.springer.com/chapter/10.1007/3-540-44674-5_33 Lessons from INR in the Specification of Transductions]''. [https://dblp.uni-trier.de/db/conf/wia/ciaa2000.html CIAA 2000]
* [[J. Howard Johnson]] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/978-0-387-21599-0_11 Using Textual Redundancy to Study the Maintainability of Source Code]''. in [https://scholar.google.ca/citations?user=4PU5ZFYV-iEC&hl=en Hakan Erdogmus], [https://dblp.uni-trier.de/pers/hd/t/Tanir:Oryal Oryal Tanir] (eds.) ('''2002'''). ''[https://link.springer.com/book/10.1007/978-0-387-21599-0 Advances in Software Engineering]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[J. Howard Johnson]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11780885_12 Collapsing ε-Loops in Weighted Finite-State Machines]''. [https://dblp.uni-trier.de/db/conf/fsmnlp/fsmnlp2005.html FSMNLP 2005]
==2010==
* [[J. Howard Johnson]] ('''2010'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-18098-9_19 Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization]''. [https://dblp.uni-trier.de/db/conf/wia/ciaa2010.html CIAA 2010]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Johnson]]
[[Category:Mathematician|Johnson]]
'''J. Howard Johnson''',<br/>
a Canadian computer scientist and research officer at the ''Institute for Information Technology'',
the [https://en.wikipedia.org/wiki/National_Research_Council_%28Canada%29 National Research Council of Canada],
in [https://en.wikipedia.org/wiki/Ottawa Ottawa] since 1992. Before, he was professor at the [[University of Waterloo]],
where he became interested in studying algorithms for [https://en.wikipedia.org/wiki/Text_processing text processing] and [https://en.wikipedia.org/wiki/Lexical_analysis lexical analysis],
such as [https://en.wikipedia.org/wiki/Finite-state_transducer#Weighted_automata weighted finite state transducer] in [https://en.wikipedia.org/wiki/Natural_language_processing natural language processing], [https://en.wikipedia.org/wiki/String-searching_algorithm string matching] and [https://en.wikipedia.org/wiki/Duplicate_code 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]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6ce737 The Twelfth ACM's North American Computer Chess Championship], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1981_ACM_NACCC/1981_ACM_NACCC.sm.062303017.pdf pdf] from [[The Computer History Museum]]</ref>.
Johnson wrote the control part of the program, Schaeffer put in the [[Knowledge|chess knowledge]] <ref>[[Jonathan Schaeffer]] ('''1997, 2009'''). ''[https://www.springer.com/gp/book/9780387765754 One Jump Ahead]''. 1. This Was Going to Be Easy, pp. 8</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/j/Johnson:J=_Howard.html dblp: J. Howard Johnson]</ref>
==1980 ...==
* [[J. Howard Johnson]] ('''1983'''). ''[https://www.semanticscholar.org/paper/Formal-models-for-string-similarity-Johnson/83b8f7815a55223b6e89dd7c55be3aec3f4fdabd Formal Models for String Similarity]''. Ph.D. thesis, [[University of Waterloo]], advisor [[Mathematician#FTompa|Frank Tompa]] <ref>[https://cs.uwaterloo.ca/~fwtompa/students.html Students Supervised], [[University of Waterloo]]</ref>
* [[J. Howard Johnson]] ('''1985'''). ''[https://link.springer.com/chapter/10.1007/BFb0015755 Do Rational Equivalence Relations have Regular Cross-Sections?]'' [https://dblp.uni-trier.de/db/conf/icalp/icalp85.html ICALP 1985] <ref>[https://en.wikipedia.org/wiki/Equivalence_relation Equivalence relation from Wikipedia]</ref>
* [[J. Howard Johnson]] ('''1986'''). ''Rational Equivalence Relations''. Research Report, [[University of Waterloo]], [https://cs.uwaterloo.ca/research/tr/1986/CS-86-16.pdf pdf]
* [[J. Howard Johnson]] ('''1987'''). ''[https://link.springer.com/chapter/10.1007/3-540-18088-5_16 Single-Valued Finite Transduction]''. [https://dblp.uni-trier.de/db/conf/icalp/icalp87.html ICALP 1987]
* [[J. Howard Johnson]] ('''1988'''). ''INR: A Program for Computing Finite Automata''. Technical Report, [[University of Waterloo]], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.456.2799&rep=rep1&type=pdf pdf]
* [[J. Howard Johnson]] ('''1989'''). ''A Unified Framework for Disambiguating Finite Transductions''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 63, No. 1, [https://core.ac.uk/download/pdf/82759963.pdf pdf]
==1990 ...==
* [[J. Howard Johnson]] ('''1993'''). ''[https://dl.acm.org/doi/10.5555/962289.962305 Identifying Redundancy in Source Code using Fingerprints]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1993.html CASCON 1993]
* [[J. Howard Johnson]] ('''1994'''). ''[https://www.computer.org/csdl/proceedings-article/icsm/1994/00336783/12OmNzlD9n2 Substring Matching for Clone Detection and Change Tracking]''. [https://dblp.uni-trier.de/db/conf/icsm/icsm1994.html ICSM 1994], [https://www.cs.drexel.edu/~spiros/teaching/CS675/papers/clone-johnson.pdf pdf]
* [[J. Howard Johnson]] ('''1994'''). ''[https://dl.acm.org/doi/10.5555/782185.782217 Visualizing textual redundancy in legacy source]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1994.html CASCON 1994], [https://dl.acm.org/doi/pdf/10.5555/782185.782217 pdf] <ref>[https://en.wikipedia.org/wiki/Hasse_diagram Hasse diagram from Wikipedia]</ref>
* [[J. Howard Johnson]] ('''1995'''). ''[https://dl.acm.org/doi/10.5555/781915.781949 Using textual redundancy to understand change]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1995.html CASCON 1995]
* [[J. Howard Johnson]] ('''1996'''). ''[https://dl.acm.org/doi/10.5555/782052.782068 Navigating the textual redundancy web in legacy source]''. [https://dblp.uni-trier.de/db/conf/cascon/cascon1996.html CASCON 1996]
==2000 ...==
* [[J. Howard Johnson]] ('''2000'''). ''[https://link.springer.com/chapter/10.1007/3-540-44674-5_33 Lessons from INR in the Specification of Transductions]''. [https://dblp.uni-trier.de/db/conf/wia/ciaa2000.html CIAA 2000]
* [[J. Howard Johnson]] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/978-0-387-21599-0_11 Using Textual Redundancy to Study the Maintainability of Source Code]''. in [https://scholar.google.ca/citations?user=4PU5ZFYV-iEC&hl=en Hakan Erdogmus], [https://dblp.uni-trier.de/pers/hd/t/Tanir:Oryal Oryal Tanir] (eds.) ('''2002'''). ''[https://link.springer.com/book/10.1007/978-0-387-21599-0 Advances in Software Engineering]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[J. Howard Johnson]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11780885_12 Collapsing ε-Loops in Weighted Finite-State Machines]''. [https://dblp.uni-trier.de/db/conf/fsmnlp/fsmnlp2005.html FSMNLP 2005]
==2010==
* [[J. Howard Johnson]] ('''2010'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-18098-9_19 Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization]''. [https://dblp.uni-trier.de/db/conf/wia/ciaa2010.html CIAA 2010]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Johnson]]
[[Category:Mathematician|Johnson]]
