Javascript doit fonctionner ! Activez-le et rechargez cette page.
Le Rézo de JeuxDeMots
• Types de relations
• Types de noeuds
• Consolider
le terme
  Options  
             

  Filtrage type relations : +   - (ex: 4, 12, 18, 36, 444, 555, 777)
  Filtrage valeur :          min   max
  Filtrage type noeuds :   +   - (ex: 4, 6, 8, 9, 10, 12, 18, 36, 444, 555, 777)

  Présentation de sortie :   (ex: -rien-, cloud, nicecloud)
 

'en:supposition'
(id=14942758 ; fe=en:supposition ; type=1 ; niveau=200 ; luminosité=25 ; somme entrante=1692 creation date=2020-09-26 touchdate=2025-11-02 07:52:33.000)
≈ 10 relations sortantes

  1. en:supposition -- r_associated #0: 32 / 1 -> cognition
    n1=en:supposition | n2=cognition | rel=r_associated | relid=0 | w=32
  2. en:supposition -- r_associated #0: 30 / 0.938 -> supposition
    n1=en:supposition | n2=supposition | rel=r_associated | relid=0 | w=30
  3. en:supposition -- r_associated #0: 29 / 0.906 -> hypothèse
    n1=en:supposition | n2=hypothèse | rel=r_associated | relid=0 | w=29
  4. en:supposition -- r_associated #0: 29 / 0.906 -> présomption
    n1=en:supposition | n2=présomption | rel=r_associated | relid=0 | w=29
  5. en:supposition -- r_associated #0: 27 / 0.844 -> forte supposition
    n1=en:supposition | n2=forte supposition | rel=r_associated | relid=0 | w=27
  6. en:supposition -- r_associated #0: 15 / 0.469 -> en:conjecture
    n1=en:supposition | n2=en:conjecture | rel=r_associated | relid=0 | w=15
  7. en:supposition -- r_associated #0: 15 / 0.469 -> en:presumption
    n1=en:supposition | n2=en:presumption | rel=r_associated | relid=0 | w=15
  8. en:supposition -- r_associated #0: 5 / 0.156 -> en:assumption
    n1=en:supposition | n2=en:assumption | rel=r_associated | relid=0 | w=5
  9. en:supposition -- r_associated #0: 5 / 0.156 -> en:supposal
    n1=en:supposition | n2=en:supposal | rel=r_associated | relid=0 | w=5
  10. en:supposition -- r_associated #0: 5 / 0.156 -> en:surmise
    n1=en:supposition | n2=en:surmise | rel=r_associated | relid=0 | w=5
≈ 97 relations entrantes

  1. présomption --- r_associated #0: 30 --> en:supposition
    n1=présomption | n2=en:supposition | rel=r_associated | relid=0 | w=30
  2. supposition --- r_associated #0: 30 --> en:supposition
    n1=supposition | n2=en:supposition | rel=r_associated | relid=0 | w=30
  3. hypothèse --- r_associated #0: 28 --> en:supposition
    n1=hypothèse | n2=en:supposition | rel=r_associated | relid=0 | w=28
  4. cognition --- r_associated #0: 20 --> en:supposition
    n1=cognition | n2=en:supposition | rel=r_associated | relid=0 | w=20
  5. forte supposition --- r_associated #0: 20 --> en:supposition
    n1=forte supposition | n2=en:supposition | rel=r_associated | relid=0 | w=20
  6. en:conjecture --- r_associated #0: 15 --> en:supposition
    n1=en:conjecture | n2=en:supposition | rel=r_associated | relid=0 | w=15
  7. en:presumption --- r_associated #0: 15 --> en:supposition
    n1=en:presumption | n2=en:supposition | rel=r_associated | relid=0 | w=15
  8. en:assumption --- r_associated #0: 5 --> en:supposition
    n1=en:assumption | n2=en:supposition | rel=r_associated | relid=0 | w=5
  9. en:foundation work --- r_associated #0: 5 --> en:supposition
    n1=en:foundation work | n2=en:supposition | rel=r_associated | relid=0 | w=5
  10. en:lay the foundations --- r_associated #0: 5 --> en:supposition
    n1=en:lay the foundations | n2=en:supposition | rel=r_associated | relid=0 | w=5
  11. en:lay the groundwork --- r_associated #0: 5 --> en:supposition
    n1=en:lay the groundwork | n2=en:supposition | rel=r_associated | relid=0 | w=5
  12. en:supposal --- r_associated #0: 5 --> en:supposition
    n1=en:supposal | n2=en:supposition | rel=r_associated | relid=0 | w=5
  13. en:surmise --- r_associated #0: 5 --> en:supposition
    n1=en:surmise | n2=en:supposition | rel=r_associated | relid=0 | w=5
  14. travail de fondation --- r_associated #0: 5 --> en:supposition
    n1=travail de fondation | n2=en:supposition | rel=r_associated | relid=0 | w=5
  15. en:abhorring --- r_associated #0: 4 --> en:supposition
    n1=en:abhorring | n2=en:supposition | rel=r_associated | relid=0 | w=4
  16. travail de fond --- r_associated #0: 4 --> en:supposition
    n1=travail de fond | n2=en:supposition | rel=r_associated | relid=0 | w=4
  17. en:disprove --- r_associated #0: 3 --> en:supposition
    n1=en:disprove | n2=en:supposition | rel=r_associated | relid=0 | w=3
  18. en:disproven --- r_associated #0: 3 --> en:supposition
    n1=en:disproven | n2=en:supposition | rel=r_associated | relid=0 | w=3
  19. en:preclude --- r_associated #0: 3 --> en:supposition
    n1=en:preclude | n2=en:supposition | rel=r_associated | relid=0 | w=3
  20. en:preparation work --- r_associated #0: 3 --> en:supposition
    n1=en:preparation work | n2=en:supposition | rel=r_associated | relid=0 | w=3
  21. en:preparations --- r_associated #0: 3 --> en:supposition
    n1=en:preparations | n2=en:supposition | rel=r_associated | relid=0 | w=3
  22. en:preparatory work --- r_associated #0: 3 --> en:supposition
    n1=en:preparatory work | n2=en:supposition | rel=r_associated | relid=0 | w=3
  23. en:candid --- r_associated #0: 2 --> en:supposition
    n1=en:candid | n2=en:supposition | rel=r_associated | relid=0 | w=2
  24. en:correcting --- r_associated #0: 2 --> en:supposition
    n1=en:correcting | n2=en:supposition | rel=r_associated | relid=0 | w=2
  25. en:explaining --- r_associated #0: 2 --> en:supposition
    n1=en:explaining | n2=en:supposition | rel=r_associated | relid=0 | w=2
  26. en:fallacy --- r_associated #0: 2 --> en:supposition
    n1=en:fallacy | n2=en:supposition | rel=r_associated | relid=0 | w=2
  27. en:gratuitous --- r_associated #0: 2 --> en:supposition
    n1=en:gratuitous | n2=en:supposition | rel=r_associated | relid=0 | w=2
  28. en:imagining --- r_associated #0: 2 --> en:supposition
    n1=en:imagining | n2=en:supposition | rel=r_associated | relid=0 | w=2
  29. en:necessities --- r_associated #0: 2 --> en:supposition
    n1=en:necessities | n2=en:supposition | rel=r_associated | relid=0 | w=2
  30. en:needless --- r_associated #0: 2 --> en:supposition
    n1=en:needless | n2=en:supposition | rel=r_associated | relid=0 | w=2
  31. en:pre --- r_associated #0: 2 --> en:supposition
    n1=en:pre | n2=en:supposition | rel=r_associated | relid=0 | w=2
  32. en:proof --- r_associated #0: 2 --> en:supposition
    n1=en:proof | n2=en:supposition | rel=r_associated | relid=0 | w=2
  33. en:abrogating --- r_associated #0: 1 --> en:supposition
    n1=en:abrogating | n2=en:supposition | rel=r_associated | relid=0 | w=1
  34. en:absolutely --- r_associated #0: 1 --> en:supposition
    n1=en:absolutely | n2=en:supposition | rel=r_associated | relid=0 | w=1
  35. en:account --- r_associated #0: 1 --> en:supposition
    n1=en:account | n2=en:supposition | rel=r_associated | relid=0 | w=1
  36. en:admitting --- r_associated #0: 1 --> en:supposition
    n1=en:admitting | n2=en:supposition | rel=r_associated | relid=0 | w=1
  37. en:appellation --- r_associated #0: 1 --> en:supposition
    n1=en:appellation | n2=en:supposition | rel=r_associated | relid=0 | w=1
  38. en:confirmed --- r_associated #0: 1 --> en:supposition
    n1=en:confirmed | n2=en:supposition | rel=r_associated | relid=0 | w=1
  39. en:confirming --- r_associated #0: 1 --> en:supposition
    n1=en:confirming | n2=en:supposition | rel=r_associated | relid=0 | w=1
  40. en:confute --- r_associated #0: 1 --> en:supposition
    n1=en:confute | n2=en:supposition | rel=r_associated | relid=0 | w=1
  41. en:contradict --- r_associated #0: 1 --> en:supposition
    n1=en:contradict | n2=en:supposition | rel=r_associated | relid=0 | w=1
  42. en:contradicting --- r_associated #0: 1 --> en:supposition
    n1=en:contradicting | n2=en:supposition | rel=r_associated | relid=0 | w=1
  43. en:contradiction --- r_associated #0: 1 --> en:supposition
    n1=en:contradiction | n2=en:supposition | rel=r_associated | relid=0 | w=1
  44. en:copulative --- r_associated #0: 1 --> en:supposition
    n1=en:copulative | n2=en:supposition | rel=r_associated | relid=0 | w=1
  45. en:corroborating --- r_associated #0: 1 --> en:supposition
    n1=en:corroborating | n2=en:supposition | rel=r_associated | relid=0 | w=1
  46. en:deceived --- r_associated #0: 1 --> en:supposition
    n1=en:deceived | n2=en:supposition | rel=r_associated | relid=0 | w=1
  47. en:deceiving --- r_associated #0: 1 --> en:supposition
    n1=en:deceiving | n2=en:supposition | rel=r_associated | relid=0 | w=1
  48. en:deductions --- r_associated #0: 1 --> en:supposition
    n1=en:deductions | n2=en:supposition | rel=r_associated | relid=0 | w=1
  49. en:entertain --- r_associated #0: 1 --> en:supposition
    n1=en:entertain | n2=en:supposition | rel=r_associated | relid=0 | w=1
  50. en:entertained --- r_associated #0: 1 --> en:supposition
    n1=en:entertained | n2=en:supposition | rel=r_associated | relid=0 | w=1
  51. en:fact --- r_associated #0: 1 --> en:supposition
    n1=en:fact | n2=en:supposition | rel=r_associated | relid=0 | w=1
  52. en:facts --- r_associated #0: 1 --> en:supposition
    n1=en:facts | n2=en:supposition | rel=r_associated | relid=0 | w=1
  53. en:fanciful --- r_associated #0: 1 --> en:supposition
    n1=en:fanciful | n2=en:supposition | rel=r_associated | relid=0 | w=1
  54. en:favouring --- r_associated #0: 1 --> en:supposition
    n1=en:favouring | n2=en:supposition | rel=r_associated | relid=0 | w=1
  55. en:favours --- r_associated #0: 1 --> en:supposition
    n1=en:favours | n2=en:supposition | rel=r_associated | relid=0 | w=1
  56. en:forbade --- r_associated #0: 1 --> en:supposition
    n1=en:forbade | n2=en:supposition | rel=r_associated | relid=0 | w=1
  57. en:groundless --- r_associated #0: 1 --> en:supposition
    n1=en:groundless | n2=en:supposition | rel=r_associated | relid=0 | w=1
  58. en:guesses --- r_associated #0: 1 --> en:supposition
    n1=en:guesses | n2=en:supposition | rel=r_associated | relid=0 | w=1
  59. en:guessing --- r_associated #0: 1 --> en:supposition
    n1=en:guessing | n2=en:supposition | rel=r_associated | relid=0 | w=1
  60. en:hooke --- r_associated #0: 1 --> en:supposition
    n1=en:hooke | n2=en:supposition | rel=r_associated | relid=0 | w=1
  61. en:imagined --- r_associated #0: 1 --> en:supposition
    n1=en:imagined | n2=en:supposition | rel=r_associated | relid=0 | w=1
  62. en:implying --- r_associated #0: 1 --> en:supposition
    n1=en:implying | n2=en:supposition | rel=r_associated | relid=0 | w=1
  63. en:improbability --- r_associated #0: 1 --> en:supposition
    n1=en:improbability | n2=en:supposition | rel=r_associated | relid=0 | w=1
  64. en:inferred --- r_associated #0: 1 --> en:supposition
    n1=en:inferred | n2=en:supposition | rel=r_associated | relid=0 | w=1
  65. en:inferring --- r_associated #0: 1 --> en:supposition
    n1=en:inferring | n2=en:supposition | rel=r_associated | relid=0 | w=1
  66. en:ingenuity --- r_associated #0: 1 --> en:supposition
    n1=en:ingenuity | n2=en:supposition | rel=r_associated | relid=0 | w=1
  67. en:justified --- r_associated #0: 1 --> en:supposition
    n1=en:justified | n2=en:supposition | rel=r_associated | relid=0 | w=1
  68. en:justifying --- r_associated #0: 1 --> en:supposition
    n1=en:justifying | n2=en:supposition | rel=r_associated | relid=0 | w=1
  69. en:logician --- r_associated #0: 1 --> en:supposition
    n1=en:logician | n2=en:supposition | rel=r_associated | relid=0 | w=1
  70. en:mendelian --- r_associated #0: 1 --> en:supposition
    n1=en:mendelian | n2=en:supposition | rel=r_associated | relid=0 | w=1
  71. en:merely --- r_associated #0: 1 --> en:supposition
    n1=en:merely | n2=en:supposition | rel=r_associated | relid=0 | w=1
  72. en:necessity --- r_associated #0: 1 --> en:supposition
    n1=en:necessity | n2=en:supposition | rel=r_associated | relid=0 | w=1
  73. en:nor --- r_associated #0: 1 --> en:supposition
    n1=en:nor | n2=en:supposition | rel=r_associated | relid=0 | w=1
  74. en:nothings --- r_associated #0: 1 --> en:supposition
    n1=en:nothings | n2=en:supposition | rel=r_associated | relid=0 | w=1
  75. en:occasions --- r_associated #0: 1 --> en:supposition
    n1=en:occasions | n2=en:supposition | rel=r_associated | relid=0 | w=1
  76. en:ockham --- r_associated #0: 1 --> en:supposition
    n1=en:ockham | n2=en:supposition | rel=r_associated | relid=0 | w=1
  77. en:precluding --- r_associated #0: 1 --> en:supposition
    n1=en:precluding | n2=en:supposition | rel=r_associated | relid=0 | w=1
  78. en:presupposing --- r_associated #0: 1 --> en:supposition
    n1=en:presupposing | n2=en:supposition | rel=r_associated | relid=0 | w=1
  79. en:presupposition --- r_associated #0: 1 --> en:supposition
    n1=en:presupposition | n2=en:supposition | rel=r_associated | relid=0 | w=1
  80. en:proofed --- r_associated #0: 1 --> en:supposition
    n1=en:proofed | n2=en:supposition | rel=r_associated | relid=0 | w=1
  81. en:reconciling --- r_associated #0: 1 --> en:supposition
    n1=en:reconciling | n2=en:supposition | rel=r_associated | relid=0 | w=1
  82. en:refute --- r_associated #0: 1 --> en:supposition
    n1=en:refute | n2=en:supposition | rel=r_associated | relid=0 | w=1
  83. en:satisfactorily --- r_associated #0: 1 --> en:supposition
    n1=en:satisfactorily | n2=en:supposition | rel=r_associated | relid=0 | w=1
  84. en:speculations --- r_associated #0: 1 --> en:supposition
    n1=en:speculations | n2=en:supposition | rel=r_associated | relid=0 | w=1
  85. en:strata --- r_associated #0: 1 --> en:supposition
    n1=en:strata | n2=en:supposition | rel=r_associated | relid=0 | w=1
  86. en:such --- r_associated #0: 1 --> en:supposition
    n1=en:such | n2=en:supposition | rel=r_associated | relid=0 | w=1
  87. en:supposing --- r_associated #0: 1 --> en:supposition
    n1=en:supposing | n2=en:supposition | rel=r_associated | relid=0 | w=1
  88. en:tenable --- r_associated #0: 1 --> en:supposition
    n1=en:tenable | n2=en:supposition | rel=r_associated | relid=0 | w=1
  89. en:that --- r_associated #0: 1 --> en:supposition
    n1=en:that | n2=en:supposition | rel=r_associated | relid=0 | w=1
  90. en:this --- r_associated #0: 1 --> en:supposition
    n1=en:this | n2=en:supposition | rel=r_associated | relid=0 | w=1
  91. en:truing --- r_associated #0: 1 --> en:supposition
    n1=en:truing | n2=en:supposition | rel=r_associated | relid=0 | w=1
  92. en:unaccountable --- r_associated #0: 1 --> en:supposition
    n1=en:unaccountable | n2=en:supposition | rel=r_associated | relid=0 | w=1
  93. en:vestiges --- r_associated #0: 1 --> en:supposition
    n1=en:vestiges | n2=en:supposition | rel=r_associated | relid=0 | w=1
  94. en:whole --- r_associated #0: 1 --> en:supposition
    n1=en:whole | n2=en:supposition | rel=r_associated | relid=0 | w=1
  95. en:wholes --- r_associated #0: 1 --> en:supposition
    n1=en:wholes | n2=en:supposition | rel=r_associated | relid=0 | w=1
  96. pierre d'angle --- r_associated #0: 1 --> en:supposition
    n1=pierre d'angle | n2=en:supposition | rel=r_associated | relid=0 | w=1
  97. travaux d'approche --- r_associated #0: 1 --> en:supposition
    n1=travaux d'approche | n2=en:supposition | rel=r_associated | relid=0 | w=1
Le service Rézo permet d'énumérer les relations existant pour un terme. Ce service est interrogeable par programme.
Projet JeuxDeMots - url: http://www.jeuxdemots.org
contact: mathieu.lafourcade@lirmm.fr