Radu Florian
Office address: |
Home address: |
| 329 New Engineering Building Johns Hopkins University Baltimore, MD 21218 Tel: (410) 516-5308, Fax: (410) 516-6134 email: <rflorian@.cs.jhu.edu> | 6 East 30th St., Apt 101 Baltimore, MD 21218 Tel: (410) 889-6682 |
Johns Hopkins University, Baltimore MD
1996-present: PhD
Candidate, Computer Science
Expected thesis area: Statistical
Natural Language and Speech Processing
Teaching Fellowship
Bucharest University, Bucharest Romania
Diploma de studii aprofundate, June 1996 (equivalent
to M.S. degree), Computer Science, GPA 10.00/10.00;
Thesis: Wavelet-based transformations
- a survey;
Merit Fellowship;
Bucharest University, Bucharest Romania
B.S.,June 1995, obtained with Diploma
de merit”, (equivalent of magna cum laude) Computer Science,
GPA 10.00/10.00.
Thesis: Speech recognition and neural
networks;
Merit Fellowship;
Professional experience
Bucharest University, Bucharest Romania
Teaching instructor
Programming Languages
C++ (Borland, ANSI, gnu, Microsoft), C (gnu, Borland, Microsoft), Pascal(Borland, Turbo, Delphi), Perl, Lisp, Scheme, Java, Prolog, Smalltalk.
Operating Systems
Solaris, SunOS, Linux, MS-DOS, MS-Windows 3.1, MS Windows95.
Projects
Speech
recognizer
As a part of my BS thesis, I have implemented a speech
recognizer in C++ It was developed from scratch, using the basic sound
functions implemented under Windows 3.1 (read utterance, open file and
read it chunk by chunk, play the file). The input file was a spoken utterance
in Microsoft WAVE format. The algorithm I investigated computed the mel-cepstral
coefficients from the input and used a dynamic time warping algorithm to
align them against a set of previously learned patterns. There were 3 patterns
for each word to be recognized; they were obtained from the training set
using a 3-NN clustering algorithm. The
system was a discrete-word, speaker-dependent recognition system. I trained
it on a data set of digits and commands, 16 words in total. The accuracy
was close to 80%.
Visualization
tool for regular grammars
As a course project, I have also implemented a visualization tool for mapping regular grammars or regular expressions to a graphical representation. One can associate every word of length n from the language generated by a regular expression with a dot on a table. My project drew that table in a window. This a method of generating fractals. I also designed an algorithm for constructing the regular grammar that generates the same language as a regular expression.
A
CASE Tool
As a team course project for an 1 year course in software engineering, I have devised and implemented a CASE tool, including the full set of stages of analysis, design, implementation, validation and maintenance. The program was written in C++.
Courses attended:
Computer
Science:
Math
and Statistics courses:
Topics of Interest
Natural
Language Processing and Understanding
Speech
Recognition
Artificial
Intelligence
Machine
Learning
Machine
Translation