Hi, I've created a script in csh that takes a file and checks it for mispelled words. Im almost done but I need to do two more things but I need help.
First, when displaying an incorrect word to the user, I need to show the line of the input file that contains the word.
Second,if the user gives a replacement word, then I need to actually replace the word in the input file.
heres my code ...........
Code:
#!/bin/csh
#script that will spell check a file
set array = (`ispell -l -p $HOME/memory.txt < $1`)
set correct = ""
set incorrect = ""
foreach word ( $array )
echo $word is mispelled. Press "enter" to keep this spelling, or type a correction
set correction=$<
if($correction == "") then
echo $word >> "$HOME/memory.txt"
else
set correct = ( $correct $correction )
set incorrect = ( $incorrect $word )
endif
end
echo "MISPELLED"'-'"CORRECTIONS"
@ counter = 1
foreach $word ( $correct )
echo $incorrect[$counter] $correct[$counter]
@ counter++
end
PLEASE HELP ME!!!
Last edited by Yogesh Sawant; 05-13-2008 at 10:12 AM..
Reason: added code tags
hello, i'm totally new to this, just trying to start learing unix. I have 2 questions really...
First, What's the difference between Linux and Unix?
Second, Where can I find/buy the Unix os?
I appriciate anyone that can help me :) (3 Replies)
I'm using a PERL cgi script that uses rrdtool to make graphs. I can't get the syntax correct to use a degree sign (alt+0176 like this °) and also using a variable.
If I use single quotes, I can't call the variable. If I use double quotes, there is an extra symbol (Â) before the ° which goes... (2 Replies)
Hi everyone,
Is there anywhere I can find a complete table of all characters that must be escaped by the various UNIX shells and scripting languages?
It seems every command/shell/scripting language has different rules about what characters must be escaped.
I do a lot of searching and... (3 Replies)
Two things : On the first place i am really desperate, on the second i am about to throw my laptop away to the recycle bin in a while.
Ok now that i expressed my feeling let me describe you this mad situation.
Code:
print $1;
("finger -m " $1 "| head -1") | getline userinfo
print... (6 Replies)
Ok so I am working on a command that is going to do a Dig @ a certain IP address which is enclosed in a variable.
Now I thought I had this figure out because it works. The problem is that it does not ALWAYS work.
the variable is IP=192.168.1.1
the commands I have tried are
dig... (2 Replies)
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
Create a script called DOTS that will display the horizontal or vertical number of dots if the first argument... (3 Replies)
Please excuse my indulgence.
Thank you MG Siegler and Steve Jurvetson. But most importantly, thank you Steve Jobs.
8rwsuXHA7RA
The world has lost a genius. (1 Reply)
Hello there,
first of all: I do not want to become a hacker. you cannot do that. you cannot learn that from a book.
Don't think I'm some kind of a script-kiddie.
now that's settled let's start.
I've been trying around with a lot of OS lately.
I have backtrack5 installed on my notebook,... (10 Replies)
Discussion started by: Dr. Nick
10 Replies
LEARN ABOUT PHP
levenshtein
LEVENSHTEIN(3) 1 LEVENSHTEIN(3)levenshtein - Calculate Levenshtein distance between two stringsSYNOPSIS
int levenshtein (string $str1, string $str2)
DESCRIPTION
int levenshtein (string $str1, string $str2, int $cost_ins, int $cost_rep, int $cost_del)
The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform $str1 into
$str2. The complexity of the algorithm is O(m*n), where n and m are the length of $str1 and $str2 (rather good when compared to simi-
lar_text(3), which is O(max(n,m)**3), but still expensive).
In its simplest form the function will take only the two strings as parameter and will calculate just the number of insert, replace and
delete operations needed to transform $str1 into $str2.
A second variant will take three additional parameters that define the cost of insert, replace and delete operations. This is more general
and adaptive than variant one, but not as efficient.
PARAMETERS
o $str1
- One of the strings being evaluated for Levenshtein distance.
o $str2
- One of the strings being evaluated for Levenshtein distance.
o $cost_ins
- Defines the cost of insertion.
o $cost_rep
- Defines the cost of replacement.
o $cost_del
- Defines the cost of deletion.
RETURN VALUES
This function returns the Levenshtein-Distance between the two argument strings or -1, if one of the argument strings is longer than the
limit of 255 characters.
EXAMPLES
Example #1
levenshtein(3) example
<?php
// input misspelled word
$input = 'carrrot';
// array of words to check against
$words = array('apple','pineapple','banana','orange',
'radish','carrot','pea','bean','potato');
// no shortest distance found, yet
$shortest = -1;
// loop through words to find the closest
foreach ($words as $word) {
// calculate the distance between the input word,
// and the current word
$lev = levenshtein($input, $word);
// check for an exact match
if ($lev == 0) {
// closest word is this one (exact match)
$closest = $word;
$shortest = 0;
// break out of the loop; we've found an exact match
break;
}
// if this distance is less than the next found shortest
// distance, OR if a next shortest word has not yet been found
if ($lev <= $shortest || $shortest < 0) {
// set the closest match, and shortest distance
$closest = $word;
$shortest = $lev;
}
}
echo "Input word: $input
";
if ($shortest == 0) {
echo "Exact match found: $closest
";
} else {
echo "Did you mean: $closest?
";
}
?>
The above example will output:
Input word: carrrot
Did you mean: carrot?
SEE ALSO soundex(3), similar_text(3), metaphone(3).
PHP Documentation Group LEVENSHTEIN(3)