int count =0; while(textReq.hasMoreTokens()){ String n= textReq.nextToken(); // reinit du tokenizer de text while(text.hasMoreTokens()){ if (n.equals(text.nextToken())){ count++; }}
int count =0; while(text.hasMoreTokens()){ if (n.equals(text.nextToken())){ //réinit du tokenizer textreq while(textReq.hasMoreTokens()){ String n= textReq.nextToken(); count++; }}
String[] mots = textReq.split(" "); int count =0; int taille = mots.length; while(text.hasMoreTokens()){ for (int i = 0; i < taille; i++){ if (mots[i].equals(text.nextToken())){ count++; } }
String[] mots = textReq.split(" "); int count =0; int taille = mots.length; int index = 0; for (int i = 0; i < taille; i++){ index = text.indexOf(mots[1]); while(index > 0){ count++; index=text.indexOf(mots[1]); } }
public static void main(String[] args){ System.out.println("bonjour"); readFile b =new readFile(); String X=b.readFile(); String replaceChaine = "(un )|(est )|( et)|(une )|(la )|(les )|(le )|(l')|(de )|(des )|(d' )|(pour )|(comme )|(ou )|(dans )"; String S = X.toLowerCase().replaceAll(replaceChaine,""); System.out.println(S); System.out.println("entrer votre requete :"); String req=lire.S(); String reqElag=req.toLowerCase().replaceAll(replaceChaine,""); System.out.println(reqElag); String[] mots = reqElag.split(" "); int count =0; int taille = mots.length; int index = 0; for (int i = 0; i < taille; i++){ index = S.indexOf(mots[i]); while(index > 0){ count++; index=S.indexOf(mots[i], index + 1); } } System.out.println ("le nombre de similariter est :"+count); }
package Indexation; import java.util.StringTokenizer; public class test { public static void main(String[] args){ System.out.println("bonjour"); readFile b =new readFile(); String X=b.readFile(); StringTokenizer text= new StringTokenizer(X); String S=""; System.out.println("Nombre de mots :"+ text.countTokens()); while(text.hasMoreTokens()){ String W= text.nextToken(); if(!((W.equals("un"))||(W.equals("est"))||(W.equals("et"))||(W.equals("une"))||(W.equals("la"))||(W.equals("les")) ||(W.equals("le"))||(W.equals("l'"))||(W.equals("de"))||(W.equals("des"))||(W.equals("d'"))||(W.equals("pour")) ||(W.equals("comme"))||(W.equals("ou"))||(W.equals("dans")))){ S= S +" "+ W; } } System.out.println(S); System.out.println("entrer votre requete :"); String req=lire.S(); StringTokenizer textReq= new StringTokenizer(req); String reqElag=""; System.out.println("Nombre de mots :"+ textReq.countTokens()); while(textReq.hasMoreTokens()){ String w= textReq.nextToken(); if(!((w.equals("un"))||(w.equals("est"))||(w.equals("et"))||(w.equals("une"))||(w.equals("la"))||(w.equals("les")) ||(w.equals("le"))||(w.equals("l'"))||(w.equals("de"))||(w.equals("des"))||(w.equals("d'"))||(w.equals("pour")) ||(w.equals("comme"))||(w.equals("ou"))||(w.equals("dans")))){ reqElag+=" "+ w; } }System.out.println(reqElag); String[] mots = reqElag.split(" "); int count =0; int taille = mots.length; int index = 0; for (int i = 0; i < taille; i++){ index = S.indexOf(mots[1]); while(index > 0){ count++; index=S.indexOf(mots[1]); } } System.out.println ("le nombre de similariter est :"+count); } }
Vous n’avez pas trouvé la réponse que vous recherchez ?
Posez votre questionwhile(text.hasMoreTokens()){ String W= text.nextToken(); if(!((W.equals("un"))||(W.equals("est"))||(W.equals("et"))||(W.equals("une"))||(W.equals("la"))||(W.equals("les")) ||(W.equals("le"))||(W.equals("l'"))||(W.equals("de"))||(W.equals("des"))||(W.equals("d'"))||(W.equals("pour")) ||(W.equals("comme"))||(W.equals("ou"))||(W.equals("dans")))){ S= S +" "+ W; } }
String S = X.replaceAll("un", ""); String S = S.replaceAll("est", ""); String S = S.replaceAll("et", ""); // etc.